Saturation for the 3-uniform loose 3-cycle

Let F and H be k-uniform hypergraphs. We say is F-saturated if does not contain a subgraph isomorphic to F, but H+e for any hyperedge e∉E(H). The saturation number of denoted satk(n,F), the minimum edges in an hypergraph on n vertices. C3(3) denote 3-uniform loose cycle 3 edges. In this work, we prove that(43+o(1))n≤sat3(n,C3(3))≤32n+O(1). This first non-trivial result fixed short cycle.